A stepwise algorithm for finding minimum evolution trees
نویسندگان
چکیده
منابع مشابه
A stepwise algorithm for finding minimum evolution trees.
A stepwise algorithm for reconstructing minimum evolution (ME) trees from evolutionary distance data is proposed. In each step, a taxon that potentially has a neighbor (another taxon connected to it with a single interior node) is first chosen and then its true neighbor searched iteratively. For m taxa, at most (m-1)!/2 trees are examined and the tree with the minimum sum of branch lengths (S) ...
متن کاملFinding Minimum Congestion Spanning Trees
Given a graph G and a positive integer k, we want to nd k spanning trees on G, not necessarily disjoint, of minimum total weight, such that the weight of each edge is subject to a penalty function if it belongs to more than one tree. We present a polynomial time algorithm for this problem; the algorithm's complexity is quadratic in k. We also present two heuristics with complexity linear in k. ...
متن کاملA Quantum Algorithm for Finding the Minimum
Let T [0..N −1] be an unsorted table of N items, each holding a value from an ordered set. For simplicity, assume that all values are distinct. The minimum searching problem is to find the index y such that T [y] is minimum. This clearly requires a linear number of probes on a classical probabilistic Turing machine. Here, we give a simple quantum algorithm which solves the problem using O( √ N)...
متن کاملA fast algorithm for finding junction trees 81 A sufficientlyfast algorithm for finding close to optimal junction trees
Au algorithm is developed for findiug a close to optimal junction tree of a given graph Tile algorithm has a worst case co~nplexity O(ckn~) where a and c are coustants, the nmnber of vertices, and k is largest clique in a juuction tree of G in which this size is mini~nized. The algorithm guarantees that the logarittHn of the size of the state space of the heaviest clique in the junction tree pr...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Biology and Evolution
سال: 1996
ISSN: 0737-4038,1537-1719
DOI: 10.1093/oxfordjournals.molbev.a025618